51f5955c5712b5a5d2ad90d7234056d96d89ead7,src/main/java/org/highj/data/impl/treeMap/Node.java,Node,deleteMin_,#,247

Before Change


                    ? hardMin()
                    : balanceR(BLACK, bHeight - 1, key, value, left.turn(RED).deleteMin_(), right.turn(RED));
        } else {
            Node<K, V> newLeft = new Node<>(BLACK, this.left.bHeight, this.left.key, this.left.value, this.left.left.deleteMin_(), this.left.right);
            return new Node<>(RED, bHeight, key, value, newLeft, right);
        }
    }

After Change


                    ? hardMin()
                    : balanceR(BLACK, bHeight - 1, key, value, left.turn(RED).deleteMin_(), right.turn(RED));
        } else {
            Node<K, V> newLeft = black(this.left.bHeight, this.left.key, this.left.value, this.left.left.deleteMin_(), this.left.right);
            return red(bHeight, key, value, newLeft, right);
        }
    }